Reasoning and Quantification in Fuzzy Description Logics

نویسندگان

  • Daniel Sánchez
  • Andrea Tettamanzi
چکیده

In this paper we introduce reasoning procedures for ALCQF , a fuzzy description logic with extended qualified quantification. The language allows for the definition of fuzzy quantifiers of the absolute and relative kind by means of piecewise linear functions on N and Q ∩ [0, 1] respectively. In order to reason about instances, the semantics of quantified expressions is defined based on recently developed measures of the cardinality of fuzzy sets. A procedure is described to calculate the fuzzy satisfiability of a fuzzy assertion, which is a very important reasoning task. The procedure considers several different cases and provides direct solutions for the most frequent types of fuzzy assertions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy description logics under Gödel semantics

Classical ontologies are not suitable to represent vague pieces of information, which has lead to the birth of Fuzzy Description Logics as an appropriate formalism to represent this type of knowledge. Different families of fuzzy operators lead to Fuzzy Description Logics with different properties. This paper studies Fuzzy Description Logics under a semantics given by the Gödel family of fuzzy o...

متن کامل

Reasoning for Fuzzy Description Logic with Comparison Expressions

The fuzzy extensions of description logics support representation and reasoning for fuzzy knowledge. But the current fuzzy description logics do not support the expression of comparisons between fuzzy membership degrees. The paper proposes ALCfc, a fuzzy extension of description logic ALC with comparison expressions. ALCfc defines comparison cut concepts to express complex comparisons, and inte...

متن کامل

Reasoning with Fuzzy Ontologies

By the development of Semantic Web, increasing demands for vague information representation have triggered a mass of theoretical and applied researches of fuzzy ontologies, whose main logical infrastructures are fuzzy description logics. However, current tableau algorithms can not supply complete reasoning support within fuzzy ontology: reasoning with general TBox is still a difficult problem i...

متن کامل

Reasoning with Large A-Boxes in Fuzzy Description Logics using DL reasoners: An experimental evaluation

While knowledge representation languages developed in the context of the Semantic Web build mainly on crisp knowledge, fuzzy reasoning seems to be needed for many applications, e.g. for retrieval of images or other resources. However, techniques for fuzzy reasoning need to scale to large A-Boxes for practical applications. As a first step towards clarifying whether fuzzy reasoning techniques ca...

متن کامل

Decidable Gödel Description Logics without the Finitely-Valued Model Property

In the last few years, there has been a large effort for analyzing the computational properties of reasoning in fuzzy description logics. This has led to a number of papers studying the complexity of these logics, depending on the chosen semantics. Surprisingly, despite being arguably the simplest form of fuzzy semantics, not much is known about the complexity of reasoning in fuzzy description ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005